Complexity measure for continuous-time quantum algorithms
نویسندگان
چکیده
منابع مشابه
Quantum Algorithms and Complexity for Continuous Problems
SFI WORKING PAPER: 2007-12-042 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...
متن کاملQuantum algorithms for continuous problems
Many problems in science and engineering are formulated using continuous mathematical models. Usually they can only be solved numerically and therefore approximately. Since they are often difficult to solve on a classical computer it’s interesting to investigate whether they can be solved faster on a quantum computer. After a brief introduction to quantum algorithms we report on a wide range of...
متن کاملAlgorithms and Complexity for Continuous Problems
From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The...
متن کاملAlgorithms and Complexity for Continuous Problems
s of Talks (in alphabetical order by speaker’s surname) Probabilistic Analysis of Interior Point Methods for Linear Programming Karl Heinz Borgwardt joint work with Petra Huhn It is our aim to make a fair comparison of the Simplex Method and Interior Point Methods on the basis of their average case behavior in the solution of Linear Programming problems possible. Therefore we use the same stoch...
متن کاملAlgorithms and Complexity for Continuous Problems
s in Alphabetical Order by Speaker’s Surname: Efficient Generation of Low Discrepancy Sequences Emanouil Atanassov joint work with Michael Mascagni 5 On the Power of Various Real-Valued Quantum Queries Arvid Bessen 5 Comparison of Three Algorithms for Finding All Vertices of a Polyhedron Based on a Probabilistic Analysis Karl Heinz Borgwardt 5 Convergence Rate for an Optimization Algorithm Unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2001
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.64.022301